package LanQiao;

import java.util.Scanner;

/**
 * 输入说明
 * 　　第一行输入N表示有N个数据（N<=1000)
 * 　　第二行N个小到大非重复的数字（<=30000)
 * 　　第三行数字X，查找X
 * 输出说明
 * 　　若X在序列中则输出其相应的位置，若不在序列中则输出”NO ANSWER".
 * 样例输入
 * 10
 * 12 34 56 78 88 99 101 134 145 233
 * 88
 * 样例输出
 * 5
 */
public class demo6 {
    public static int func(int[]array,int x){
        int left = 0,right = array.length-1,tmp = array.length;
        while (left <= right){
            int mid = left+(right-left)/2;
            if(x > array[mid]){
                left = mid+1;
            }else if(x < array[mid]){
                tmp = mid;
                right = mid-1;
            }else{
                return mid;
            }
        }
        return tmp;
    }
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int []array = new int[n];
        for (int i = 0; i < array.length; i++) {
            array[i] = scanner.nextInt();
        }
        int x = scanner.nextInt();
        int ret = func(array,x);
        if(x < array[0] || x>array[array.length-1] || (array[ret] != x)){
            System.out.println("NO ANSWER");
        }else{
            System.out.println(ret+1);
        }
    }
}
